منابع مشابه
A Note on Authentication Codes
In this short note we show that the bound provided by Theorem 3.8 in 4] is not correct by exhibiting a counter example. We identify the aw in the proof of Theorem 3.8 in 4] and then we prove a correct bound on P S .
متن کامل1 Binary Greedy Codes
In this paper, we provide a simpler proof of a previously known result about greedily generated binary codes. We consider the mapping g: Vn ⇒ Vm, which sends binary vectors to their gvalues obtained from a B-ordering. We show that g is a homomorphism via a proof by induction on gvalues. The proof depends on a previous result that the set of vectors having g-value 0 is a linear code. We also dis...
متن کاملA Note on the Dual Codes of Module Skew Codes
In [4], starting from an automorphism θ of a finite field Fq and a skew polynomial ring R = Fq[X; θ], module θ-codes are defined as left R-submodules of R/Rf where f ∈ R. In [4] it is conjectured that an Euclidean self-dual module θ-code is a θ-constacyclic code and a proof is given in the special case when the order of θ divides the length of the code. In this paper we prove that this conjectu...
متن کاملA note on Efremenko's Locally Decodable Codes
There have been three beautiful recent results on constructing short locally decodable codes or LDCs [Yek07, Rag07, Efr09], culminating in the construction of LDCs of subexponential length. The initial breakthrough was due to Yekhanin who constructed 3-query LDCs of sub-exponential length, assuming the existence of infinitely many Mersenne primes [Yek07]. Raghavendra presented a clean formulati...
متن کاملA Note on Decoding of Superimposed Codes
A superimposed code with general distance D can be used to construct a non-adaptive pooling design. It can then be used to identify a few unknown positives from a large set of items by associating naturally an outcome vector u. A simple method for decoding the outcome vector u is given whenever there are at most bD−1 2 c errors occuring in the outcome vector u. Moreover, another simple method o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1996
ISSN: 0097-3165
DOI: 10.1006/jcta.1996.0096